A Unified Successive Pseudoconvex Approximation Framework
نویسندگان
چکیده
منابع مشابه
a 10-bit 50-ms/s parallel successive-approximation analog-to-digital converter
applications such as high definition viedeo reproduction, portable computers, wireless, and multimedia demand, and ever-increasing need for ligh-frequency high-resolution and low-power analog-to-digital converters. flash, two-step flash, and pipeline convertors are fast but consume large amount of power and require large area. to overcome these problems, successive approximation converter blo...
15 صفحه اولHolomorphic Approximation on Compact Pseudoconvex Complex Manifolds
Let M be a smoothly bounded compact pseudoconvex complex manifold of finite type in the sense of D’Angelo such that the complex structure of M extends smoothly up to bM . Let m be an arbitrary nonnegative integer. Let f be a function in H(M) ∩Hm(M), where Hm(M) is the Sobolev space of order m. Then f can be approximated by holomorphic functions on M in the Sobolev space Hm(M). Also, we get a ho...
متن کاملA Novel Successive Approximation Method for Solving a Class of Optimal Control Problems
This paper presents a successive approximation method (SAM) for solving a large class of optimal control problems. The proposed analytical-approximate method, successively solves the Two-Point Boundary Value Problem (TPBVP), obtained from the Pontryagin's Maximum Principle (PMP). The convergence of this method is proved and a control design algorithm with low computational complexity is present...
متن کاملParsing by Successive Approximation
It is proposed to parse feature structure-based grammars in several steps. Each step is aimed to eliminate as many invalid analyses as possible as e ciently as possible. To this end the set of feature constraints is divided into three subsets, a set of context-free constraints, a set of ltering constraints and a set of structure-building constraints, which are solved in that order. The best pro...
متن کاملDeinterlacing by successive approximation
We propose an algorithm for deinterlacing of interlaced video sequences. It successively builds approximations to the deinterlaced sequence by weighting various interpolation methods. A particular example given here uses four interpolation methods, weighted according to the errors each one introduces. Due to weighting, it is an adaptive algorithm. It is also time-recursive, since the motion-com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2017
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2017.2684748